Krohn-Rhodes complexity pseudovarieties are not finitely based
نویسندگان
چکیده
We prove that the pseudovariety of monoids of Krohn-Rhodes complexity at most n is not finitely based for all n > 0. More specifically, for each pair of positive integers n, k, we construct a monoid of complexity n+1, all of whose k-generated submonoids have complexity at most n. Mathematics Subject Classification. 20M07.
منابع مشابه
Complexity Pseudovarieties Are not Local: Type Ii Subsemigroups Can Fall Arbitrarily in Complexity
We prove the following two results announced by Rhodes: The Type II subsemigroup of a finite semigroup can fall arbitrarily in complexity; the complexity pseudovarieties Cn (n ≥ 1) are not local.
متن کاملOn the join of two pseudovarieties
The aim of this lecture is to survey some recent developments in the theory of finite semigroups. More precisely, we shall consider the following problem about pseudovarieties of semigroups: given two pseudovarieties V and W, find a description of their join V ∨W (that is, of the pseudovariety they generate). This question is motivated by the theory of rational languages: it appears in a natura...
متن کاملFinite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata
ON NON-EMPTY WORDS IN FINITE AUTOMATA PÁL DÖMÖSI, CHRYSTOPHER L. NEHANIV, AND JOHN L. RHODES ABSTRACT. This paper relates classes of finite automata under various feedback products to some well-known pseudovarieties of finite semigroups via a study of their irreducible divisors (in the sense of Krohn-Rhodes). In particular, this serves to relate some classical results of Krohn, Rhodes, Stiffler...
متن کاملConstructing divisions into power groups
The result, due to Henckell, Margolis, Pin and Rhodes modulo Ash’s solution to the pointlike conjecture, that every finite block group divides a power group, has long been considered to be one of the deepest results in finite semigroup theory. However, the proof is not constructive. Solving a long-standing problem, we provide in this paper an explicit construction of such a division. We also ge...
متن کاملAn Effective Lower Bound for Group Complexity of Finite Semigroups and Automata
The question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, Complexity of finite semigroups, Annals of Mathematics (2) 88 (1968), 128–160, motivated by the Prime Decomposition Theorem of K. Krohn and J. Rhodes, Algebraic theory of machines, I: Prime decomposition theorem for finite semigroups and machines, Transactions of the Ameri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 39 شماره
صفحات -
تاریخ انتشار 2005